A corrected version of the Duchet kernel conjecture
نویسندگان
چکیده
منابع مشابه
A corrected version of the Duchet kernel conjecture
In 1980 Piere Duchet conjectured that odd directed cycles are the only edge minimal kernel-less connected digraphs i.e. in which after the removal of any edge a kernel appears. Although this conjecture was disproved recently by Apartsin, Ferapontova and Gurvich (1996), the following modiication of Duchet's conjecture still holds: odd holes (i.e. odd non-directed chordless cycles of length 5 or ...
متن کاملA Version of the Volume Conjecture
Abstract. We propose a version of the volume conjecture that would relate a certain limit of the colored Jones polynomials of a knot to the volume function defined by a representation of the fundamental group of the knot complement to the special linear group of degree two over complex numbers. We also confirm the conjecture for the figure-eight knot and torus knots. This version is different f...
متن کاملA Combinatorial Version of the Grothendieck Conjecture
We study the “combinatorial anabelian geometry” that governs the relationship between the dual semi-graph of a pointed stable curve and various associated profinite fundamental groups of the pointed stable curve. Although many results of this type have been obtained previously in various particular situations of interest under unnecessarily strong hypotheses, the goal of the present paper is to...
متن کاملImprovements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
Probably the best-known among the remaining unsolved problems in graph theory is Hadwiger’s Conjecture: If χ(G) denotes the chromatic number of graph G, then G has the complete graph Kχ(G) as a minor. The following would immediately follow from the truth of Hadwiger’s Conjecture: Conjecture: If G has n vertices and if α(G) denotes the independence number of G, then G has Kdn/α(G)e as a minor. I...
متن کاملA note on the Path Kernel Conjecture
Let τ(G) denote the number of vertices in a longest path in a graph G = (V , E). A subset K of V is called a Pn-kernel of G if τ(G[K ]) ≤ n−1 and every vertex v ∈ V \K is adjacent to an end-vertex of a path of order n− 1 in G[K ]. It is known that every graph has a Pn-kernel for every positive integer n ≤ 9. R. Aldred and C. Thomassen in [R.E.L. Aldred, C. Thomassen, Graphs with not all possibl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00094-0